Automatic search method

ABSTRACT

An automatic search method for documents stored in a data processing system is presented. The method involves preselecting large amounts of data automatically thereby enabling the user to find relevant information easily. The task of comparing search string and document content is assigned to the user who does not need to formulate any query statement but browses the documents by comparing their representatives and choosing the ones which fit the query statement. Search terms comprise representatives of the documents, extracts of the documents, or synonyms of the extracts which function as nodes of the semantic network wherein the edges are set up by various relations between the search objects, as for example, detailing relations, thesaurus relations, and combining relations. Movements along the edges are simulated by retrievals of the data storage resulting in new nodes presented to the user in a viewing device of the system.

BACKGROUND OF THE INVENTION

The invention refers to an automatic search method for documents storedin a data processing system.

For the first time the emergence of the internet enables everybody toaccess a huge amount of information. The fast rise of the amount ofinformation supplied by the internet however hampers user to find therelevant information. Search engines in use so far retrieve through aquery combining query terms by logical operators texts containing thecombinations of the search terms.

Even the present amount of the internet's information generates resultlists of more than 1000 results. It is nearly impossible for the user toevaluate the displayed results properly. Moreover, duplicates orrepeatedly displayed items happen in the same result list becausedocuments are accessible by various uniform resource locators or becausedocuments are not retrieved according to unified rules.

The mentioned invention intends to generate a method for automaticsearch for documents stored in a data processing system. It preselectseven big amounts of data automatically enabling the user to findrelevant information easily. The system is designed ‘futureproof’ thatmeans capable to handle further growing amounts of informationaccessible through internet. In conventional information retrievalsystems users formulates query terms, which are compared with eachdocument or its representative (assigned classification, keyword). Thiscomparison has so far been optimized by system engineers from bothsides. On the one hand, the representation of the document was improved,on the other hand the procedure of the comparison and the representationof the search strings have been improved.

BRIEF SUMMARY OF THE INVENTION

The invention realizes a new approach assigning the task of comparingsearch string and document content to the user.

The user however does not need to formulate any query statement butbasically browses the documents by comparing their representatives andchoosing the ones which fit.

The representatives of the documents, extracts of the documents orsynonyms of the extracts are called search terms. They function as nodesof a semantic network whereas the edges are set up by various relations(detailing relations: connections of shorter with longer search objects,thesaurus relations, combining relations) between the search objects.

A semantic network is defined as a set of semantic concepts arranged inform of a network and functioning as nodes. The semantic concepts ornodes are joined by edges rendered by relations of meaning or by conceptrelations.

The semantic network is stored as knowledge base of the system in a datastorage (preferably implemented by a data base) with search objectsrespectively nodes as objects and the relations between the search termsrespectively the edges as attributes.

Movements along the edges are simulated by retrievals of the datastorage resulting in new nodes presented to the user in a viewing deviceof the system.

The data pool of the method is organized such that the user approachesafter several selections a set of documents. The user starts at ageneral search term passing more and more special search objects andending at document profiles, which are the most direct representativesof those documents, which are related to the document.

As a further peculiarity the data pool supports setting up domainsdefined as personalized parts of the general data pool (called externaldata in the following), accessible only for authorized users in apersonalized part of the data storage or in a separate data storageassigned to the authorized user (called internal data in the following).A separate data storage is set up by copying the documents and theirrepresentatives to the data storage accessed only by the user owning thedomain.

Thus, all search-infrastructure of a document is transferred in a way itcan be retrieved in the domain as well as in the general data storage.Domains are set up for instance by archiving.

The invention displays representatives of documents in a manner suitablefor information retrieval to the user by computers and database systems(as data storage) and supports the navigation of the user in a semanticnetwork.

It list preferred that text extracts applying to more than one documentare displayed only once. Thus, duplicates and repeated items areavoided.

It list preferred that extracts applying to more than one document areconnected to each document so that several documents can be accessed bya single common representative.

According to the invention it is preferred that in the course of thesearch process the queries get more and more specific so that lessdocuments are represented. The representations however get wider. Thus,the same amount of information has to be processed by the user gettingthe right information on less relevant documents.

It is preferred that in any case the query comprises search objects inform of search terms or directories designed as matrices or networkplans connected logically to document profiles and via these todocuments. Therefore, the user gets the favourite access to information(it is assured that the user is extensively informed on relevantdocuments).

It is preferred that in case of adding documents to the data storage orremoving documents from the data storage the logical connections betweensearch objects and documents and document profiles are adapted, whereasthe search objects remain the same. Therefore, the user can easilysurvey if new information is generated in certain special fields, forexample, a patent retrieval on special fields of technics can berepeated regularly so that only new publicated documents are retrieved.

The function of the document profiles as surrogates for the documentsthemselves are to deliver all information necessary for the searchprocess so that data and information transfer between system componentsand user is minimized. According to the invention, they compriseextracts of the document (the longest ones which are directly connectedto the document profiles), details about the document itself, detailsconcerning the system and a link to the document.

Furthermore, it is preferred that search objects are connected with eachother hierarchical. If a user chooses one or more search objects, thedata processing system selects and displays connected, longer searchobjects on a viewing device giving more detailed information on therepresented document and containing the search objects chosen by theuser.

The user can choose one or more of the subordinated, more detailedsearch objects and execute further search processes. Again, as a result,even more detailed search objects are displayed on the viewing device.

Furthermore, it is preferred that search terms belonging togetherbecause of their content are connected via one or more of the followingrelations: superordinated, related or subordinated search term.Connections taking into consideration these relations support users tocarry out successful retrieval even without remembering all specialistterms.

The search process is further supported by merging of synonyms into asingle search object.

The search is moreover improved by constraints not concerning thesubject. They can be defined by the user and set parameters restrictingthe results of the complete search process. Such constraints make itpossible to retrieve for example patent documents published before apriority date.

Further objects and advantages of this invention will be apparent formthe following detailed description of a presently preferred embodiment,which is illustrated schematically in the accompanying drawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 a model of the entire system;

FIG. 2 the subset relations of search objects, document profiles anddocuments;

FIG. 3 properties of the search terms along a chain of search termsconnected by the detailing relation;

FIG. 4 a detailed view of subset relations of search terms;

FIG. 5 subset relations of two search terms in a focused view;

FIG. 6 subset relations of two search terms, document profiles anddocuments;

FIG. 7 the detailing relation between search terms and document(profiles), as reversed subset relation;

FIG. 8 complete view on a chain according to FIG. 7 containing theadditional search objects document profile and a document fordemonstration of effect and function of the text aperture;

FIG. 9 function of the text aperture implemented by output field in theuser interface; different degrees of detailing are marked by differentindentions in the output field as well as by comments illustrating thefigure;

FIG. 10 the effect of selection of certain search objects by the user byinput options of the computer on the representation of the semanticsearch space;

FIG. 11 running through various levels of detailing; at any level thesystem presents search terms in the output field of the user interfacefrom which the user chooses some of the items, others not;

FIG. 12 possible types of ratio between detailed and detailing searchterm;

FIG. 13 the possibilities of branching via the detailing relationapplied to a search word;

FIG. 14 comparison of “state-of-the-art” search systems and theinvention regarding the amount of results a user has to evaluate;

FIG. 15 thesaurus relation sketched analogous to FIG. 2;

FIG. 16 characteristics of thesaurus relation in the semantic space;

FIG. 17 differences between thesaurus relation and detailing relationillustrated by examples;

FIG. 18 introduction of constraints not concerning the subject to thesearch process and effect on selected results;

FIG. 19 introduction of constraints concerning the subject to the searchprocess via the combination relation and effect on selected results;

FIGS. 20 to 27 the search process using all kinds of constraintsavailable;

FIG. 28 overview of the actions of the specialised search mode(invention);

FIG. 29 possibilities to change the subject range;

FIG. 30 actions to change the subject range;

FIG. 31 an application example of internet retrieval (screenshot inNetscape));

FIG. 32 example for a problem chain (product development consumer massproduct) applied by the problem oriented search mode;

FIG. 33 an additional problem chain (marketing consumer mass product);

FIG. 34 “state-of-the-art” classification system;

FIG. 35 search terms applied by the specialised search mode compared toa classification system, sketched analogous to FIG. 34;

FIG. 36 influence of constraints on the search branching of specialisedsearch mode (the invention) compared to a “state-of-the-art”classification system;

FIG. 37 “state-of-the-art” keyword system containing unrelated keywords;

FIG. 38 invention compared to keyword system of FIG. 37 in a focusedmodel;

FIG. 39 search paths of a “state-of-the-art” keyword system;

FIG. 40 available search paths of the invention;

FIG. 41 available search paths of the invention of FIG. 40 as example;

FIG. 42 search path of the invention;

FIG. 43 system environment of an implementation of the invention;

FIG. 44 model of the detailing relation;

FIG. 45 an example for improper assignment of search paths;

FIG. 46 proper assignment of search paths in opposition to FIG. 45;

FIG. 47 model of the subordinating relation;

FIG. 48 model of the associating relation;

FIG. 49 model of the superordinating relation;

FIG. 50 model of the combining relation;

FIGS. 51 a and b model of data objects according to the invention;

FIG. 52 legend of FIGS. 51 a and 51 b;

FIG. 53 list of preferred attributes of the attributes of the searchobjects;

FIG. 54 depiction of search list database/-file according to theinvention in form of a table;

FIG. 55 depiction of thesaurus database/-file according to the inventionin form of a table;

FIG. 56 depiction of resource database/-file according to the inventionin form of a table;

FIG. 57 depiction of index database/-file according to the invention inform of a table;

FIG. 58 example for document profile according to the invention;

FIG. 59 example for structure of a document database/-file according tothe invention;

FIG. 60 example for user interface according to the invention;

FIG. 61 example user interface for displaying and defining constraintsnot concerning the subject according to the invention;

FIG. 62 function model sketching main steps of the entire search processfor external information according to the invention;

FIG. 63 function model sketching main steps of the entire search processfor internal information according to the invention;

FIG. 64 function model of the main steps of a server based searchprocess according to the state of the art;

FIG. 65 flow diagram for specification at the preselection according tothe invention;

FIG. 66 flow diagram for specification at the main selection accordingto the invention;

FIG. 67 flow diagram for specification at the final selection accordingto the invention;

FIG. 68 flow diagram for the archiving according to the invention;

FIG. 69 legend for FIGS. 65 to 68;

FIG. 70 structure diagram for preferred preselection according to theinvention;

FIG. 71 structure diagram for process control at the main selectionaccording to the invention;

FIG. 72 process model for preselection according to the invention;

FIG. 73 process model for updating the search list according to theinvention;

FIG. 74 process model for search list query according to the invention;

FIG. 75 process model for action ‘limitate’ according to the invention;

FIG. 76 process model for actions ‘combine’, ‘include’ and ‘exclude’according to the invention;

FIG. 77 process model for main selection at an early stage according tothe invention;

FIG. 78 process model for main selection at a later stage according tothe invention;

FIG. 79 process model for final selection according to the invention;

FIG. 80 process model for archiving according to the invention;

FIG. 81 legend for FIGS. 73 to 80;

FIG. 82 an interface model for prelimitation according to the invention;

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The complete system to which the invention is applied containsdocuments, which can be searched and copied free of charge or in returnfor payment on an internal or external server.

Each document has a document profile giving access to the document. Thecomplete system is depicted in FIG. 1

Documents can be accessed by three search modes: specialised searchmode, overviewing search mode and problem oriented search mode. Eachmode uses its own search objects supporting the process.

The specialised search mode uses search terms consisting of textextracts or their synonyms or allows direct access to document profilesand documents. It is preferably implemented by database queriesrendering document profiles either directly or indirectly viaintermediary search terms.

The overviewing search mode uses directories in form of a matrix, theproblem oriented search mode directories in form of network plans eachgiving access to the document profiles stored in a data base anddocuments. The connection between these objects and the documentprofiles to be retrieved are fixed so that results are predefined.

All search objects—search terms, directories in form of a matrix anddirectories in form of network plans have something in common: they areall subject related as well as connected to document profilesrepresenting documents containing the same topic. However, amount anddegree of specificity of search terms are by far higher than those ofdirectories.

Compared to document and document profiles search object are quitestatic. By the time they have to be changed by far less than thedocuments stored in the system. New documents entail new connections toknown search objects but not necessarily new search objects. Thereforeusers are enabled to run search routines retrieving latest documentsassigned to favorable search terms periodically.

Search for New, Public Information

The search for new and public information is generally performed on a(internet)-server as illustrated in FIG. 1.

Search for Archived/Personalized Private Information

At retrieval of a document the document and all connected objects toretrieve the document (document profile, search objects) are transferredto a client related data storage (transferred component are flagged byapostrophes) so that the search process for that special document can bereproduced for the client system in the same way as for the serversystem.

New documents can be recorded either by the server system (publicdocument) and be at the disposal of all clients or by a client system(private document) and be only at the disposal of the same client. Eachclient is able to set up an individual domain comprising documents andsearch structures defined by the user.

The invention is used together with further components so that threeparts can be used altogether:

1. document management system

2. system for automatic retrieval according to the invention

3. e-commerce system

The document management system records new documents and generatessearch objects.

In order to integrate public and private documents and retrieve togetherthe client comprises a document management tool, which has an interfaceto the server based document management system to use its resources. Thetool also enables the user to set up his own search objects for privatedocuments.

The system for automatic retrieval according to the invention is aninstrument by which the user can access all objects. Server and clientversion have the same features (the interfaces differ however accordingto e.g. different database systems).

The e-commerce system supports the download of documents as soon asonline payment has been done. Moreover, it generates user profilescontaining performed download actions and search routines. It is onlyimplemented on servers.

A document is defined as information product usable independent fromother documents, for example complete essays, records from a databasecontaining facts or complete software programs.

Document profiles are representatives of the documents retrieved onbehalf of the documents. They contain all necessary meta information anda link on a resource in the internet or on any document server connectedby any type of network. They give full details of a document to a userto help him deciding whether to download a document.

Documents tell the user what a document contains whereas it tells thesystem how to find it. It contains the following details:

-   -   1. details considering the subject, for example title or        abstract (subject related, visible for the user)    -   2. details considering the document, for example date of        publication, price, author (not subject related, invisible for        the user)    -   3. details considering the system, for example document        identification, (not subject related, invisible for the user)    -   4. a link to the document

Details described in topic 1 and 2 are relevant for the user, thedetails described in topic 3 and 4 only for the system. The last topicalso serves for the postprocessing of the retrieval.

The type and amount of details considering the system are identicalamong document types and subtypes, however details considering thesubject and details considering the document vary considerably.

Various types of document profiles represent different types ofdocuments/information and their structure. They are:

1. expert articles

2. (explanations, translations: without document profile)

3. descriptions of training and education offers

4. events

5. tools, templates

6. product information, markets

7. experts, contacts, addresses

8. acts, regulations and their subtypes.

Search text includes parts of the text of a document helpful as searchcriteria. The invention imitates the procedure of a reader searching forinformation and displays him important parts of the text (via searchterms) automatically structured so that he can easily and quicklyrecognize the parts and compare with important parts of other documents.

The more documents can be found to a subject the more search text thereader has to review to compare all documents. If only chapter headlinesof books and magazines had been defined as search text, the reader wouldhave to check pages of text to find relevant information. He couldeasily lose track.

Hence, search aids are implemented which abstract and present the searchtext of several documents automatically and clearly structured to theuser to improve orientation.

‘Search terms’, extracts of the search terms of different size connectedto document profiles put such search aids to practice. They function asa text aperture, which can be adjusted accordingly by the user to seebigger or smaller parts of the search text. Search terms occurring inmore than one document are connected with all document profiles and onlydisplayed once. Synonyms are merged. The structure of the search termsis depicted in FIG. 2. They contain concepts and mostly consist ofnominal expressions.

Four types are used:

search word e.g. car compound e.g. scrapping of cars noun phrase e.g.scrapping of cars according to EU law search sentence e.g. scrapping ofcars according to EU law leaves questions unanswered

The rules of formation of search terms are:

A compound must contain at least one search word.

A noun phrase must contain at least one search word or a compound(containing a search word). A noun phrase has furthermore to contain atleast two concepts and their explicit relation.

A search sentence must contain at least one search word or one compound(containing a search word) or a noun phrase (containing a search worddirectly or via a compound). A search sentence can either be formulatedfrom search text or straightly be copied from sentences of the searchtext. It must be understandable on its own without any additionalannotations.

All search terms can only be taken or formulated from parts of searchsentences.

The level of detail of the representation of the search text increasesfrom search words via compounds and noun phrases to search sentences(see FIG. 3). The context of each search term is specified by searchterms appearing on its right hand (see FIG. 3).

Accompanying the rising level of detail length and complexity increasefrom the left to the right side of FIG. 3.

The relations between the search terms are crucial to guide the user andto the search process. They can be divided into three types: thedetailing relation, the thesaurus relation and the combining relation.The detailing relation is described in the following and by FIGS. 4-7.

FIG. 4 shows the detailing relation.

All search terms apart from search words are based on others and searchterms are based directly or indirectly on a search word. They areconcept components, have substantial subset relations and are nested.

Substantial subset relations exist between a detailing search term and adetailed search term as well as between a search term, a documentprofile and a document; one is a substantial component of the other. Itmaps an aspect a natural search path to the detailed search term.

The substantial subset relations are depicted in FIG. 5.

The substantial subset relations of search terms and of document(s)(-profiles) are depicted in FIG. 6.

Elements having a substantial subset relation are connected. Theconnection is called detailing relation, as depicted in FIG. 7.

Detailing is defined as precising the situational meaning/context.

A detailed search term is contained in a detailing search term and itscontext is precised by the latter. (Additionally further expressionspecificating the meaning are contained which need not be search termsnecessarily).

A search word details at least a compound in which it is contained.Likewise noun phrases are detailed by the contained search words andcompounds. Search sentences contain and detail all other types of searchterms.

The detailing relation enables the user to see differently detailed andsized extracts of the search text and thus of the document as depictedin FIG. 8. (The detailed search term is always on the left side of thedetailing search term).

The feature to see extracts of different size can be compared to anaperture, which can be adjusted by the user.

In the course of the search process, the user reaches search terms,which are more and more detailed, and thus widens the aperture, asdepicted in FIG. 8.

By widening the aperture, the user can see more detailed, more complexand longer extracts of the search text and of its document. As aconsequence, he has to reduce the number of search terms more and morein order to avoid information overload.

This effect can be compared to optical zooming. By zooming in, aphotographer gets a more detailed view of an object, the increasing sizeof the mapped objects however forces a concentration on fewer objectsbecause of the fixed maximum size of the projection area. Otherwise, notall objects can be displayed.

Search terms are projections of the object document with differentsemantic enlargement scales analogous to different geometric enlargementscales manipulated by zooming. The more detailed the projection is (thebigger the zoom factor) the user chooses the less search termsrespectively documents he can see.

FIG. 9 depicts the “projection area” of the search system, an outputfield in the user frontend.

However, in opposition to the geometric case several projections ofdocuments with different zoom factors are displayed at the same time.The document profile represented by a search sentence appears not verymuch reduced, whereas documents relating to the subject “engineersalaries” in FIG. 9 appear quite reduced and not detailed.

The output field can be scrolled analogous to moving a lens bringing newobjects into sight. The user is however motivated to early concentrateon few relevant objects in order not to scroll. He can delete otherobjects and exclude them from the further search process.

Thus more space remains for the rest to execute further actions ofdetailing, as depicted in FIG. 10.

A summary of form of a catalogue or a directory is presented to the userwhose paths are opened step by step (see FIG. 10).

The branchings of the chosen search terms are displayed in the outputfield where the user can choose items (black beam in FIG. 11) in orderto involve them in another action of detailing.

The course of the preferred search sketched in FIG. 11 is idealized, inreality there appear also “short cuts”. A noun phrase for instance maycontain a search word but no compound or a search sentence may contain asearch word or compound but no noun phrase (see FIG. 12).

The method ensures that always the same type of search term is selectedand skips types not represented by the detailing relation of the chosensearch terms.

The ratio of detailed and detailing search term is n:m, that means adetailed search term can always be detailed by one or more detailingsearch terms (case a). The other way round a detailing search term candetail one or more search terms, as depicted in FIG. 12.

The branching possibilities of the detailing relation applied to asearch word are depicted in FIG. 13.

The detailing relation has the following advantages:

Dividing of selection into several successive steps by means of searchterms getting increasingly detailed has several advantages:

The user can influence the direction of the search process and refine iteven after he chose a search word. He is not forced to view the finalsearch result (the document itself) and evaluate it, which is—comparedto the evaluation of a search term—much more complex, confusing and timeconsuming in order to modify the search strategy and run a new searchprocess as it happens by the use of conventional search systems usingfor example relevance feedback.

The user does not have to formulate a query statement or query term, hejust has to choose from search terms. That reliefes the process whenlonger search terms have to be handled (e.g. noun phrases).

The increasing branching sketched in FIG. 13 causes—by increasing degreeof detailing—a reduction in amount of documents connected to each singlesearch term (=degree of representation, see FIG. 11), because the amountof documents is divided by detailing search terms: A general search termlike the search word ‘engineer’ is connected to all documents, also todocuments which are connected to the compounds ‘mechanical engineer’,‘electrical engineer’ and so on. Therefore, it represents more documentsthan the compounds which means its degree of representation is higher.

For the sake of straightforwardness and because of limited space theuser usually limits or even reduces of displayed search terms.

The amount of documents connected to the displayed search terms isreduced because of the decreasing degree of representation typical ofmore detailed search terms appearing in the course of the searchprocess.

FIG. 14 illustrates that in case of the invention fewer results have tobe evaluated than in case of conventional search systems and thatmoreover the evaluations are less complex as search terms are shorterand easier to check than whole documents.

FIG. 15 shows that a conventional system querying after formulation of aquery term relevant documents or document profiles directly and skippingthe intermediate stages of querying other (more detailed) search terms.Such a system causes the user according to FIG. 15 to evaluate 16results. In case of application of the invention under the sameconditions and a selection quota of 50%, the user has to evaluate only12 results most of them being search terms and therefore less complex toevaluate than documents.

In addition to the detailing relation, the invention comprises thethesaurus relations.

They connect search terms having no substantial subset relations butlocated side by side in the search text. These are independent conceptsbut nevertheless related by their content (=thesaurus relations,depicted in FIGS. 15 and 16). They include the types subordinatingrelation, superordinating relation and associating relation.

As illustrated in FIG. 16, search terms connected by thesaurus relationscan have the following status:

BT (broader term=subordinated search term)

NT (narrower term=superordinated search term) and

RT (Related term=associated search term)

Thesaurus relations can be distinguished from detailing relations by thefollowing characteristics:

In case of detailing relations, the situational meaning/context ofsearch terms is precised and it is substantially contained in anothersearch term. That means that detailed and detailing search term haveconcepts in common, the detailing search term however enriches theconcepts by adding details or aspects accompanied by bigger length andcomplexity as illustrated in FIG. 3. As a consequence the detailingrelation guides the user from general to special topics.

The search terms connected by thesaurus relations usually have noconcepts in common. They only belong together because of their meaningand not linguistically.

One search term is not contained in the other and its context is notdefined by the other.

The thesaurus relation is independent from the detailing relation, whichcan be apply additionally.

The BT/NT-relations are mutual, that means if a search term issuperordinated to another (having status ‘BT’ concerning theconnection), the latter is subordinated to the first and has the status‘NT’ concerning the connection.

A NT often defines a value or a subgroup of a BT.

An expression for the detailing relation is:[less detailed search term]−“more precise”→[more detailed search term]

A corresponding expression for the BT/NT-Relation is:[NT]−“part of/characteristic/type/example of”→[BT]

Graphically, both relations are illustrated in FIG. 16.

Synonyms are search terms having strictly the same meaning. They aremerged in the way that the relations assigned to one apply likewise tothe other.

An example are the synonyms “Great Britain” and “United Kingdom”. Thenoun phrase “economical situation in Great Britain” is connected withthe search word “Great Britain” as well as with the search word “UnitedKingdom”. Thus, the method selects the search terms related to a synonymwithout displaying it.

RT are associative search terms with similar meaning.

The relation between a search term and its RT is consequently calledassociating relation.

Thesaurus relations are preferably used for the following actionsperformed by the method:

specialize (NTs are queried)

enlarge (RTs are queried)

generalize (BTs are queried)

If a user has chosen a search term being too special and therefore getstoo few results, he can generalize it by BTs and increase the amount ofresults. BTs can give an overview and render alternatives.

Following querying of NTs can lead to new aspects and give ideas for newsearching.

If a user searches for example for “fertilizer for sunflowers” and getsfew results, he can query the BT “fertilizer for flowers”. Thus, he isgiven the hint that the searched term belongs to fertilizers for flowersand an approach to continue searching. The NTs of the latter search termare several types of fertilizer for flowers which can be checked by theuser if being suitable, like “fertilizer for corn poppy”.

The RTs may induce continued searching as well if the search process haslead into an impasse.

The invented method however implicitly (that means displaying to theuser not before search sentences are to be queried) queries NTs as well.Otherwise, it could happen that a user searches for “fertilizer forflowers” and relevant documents concerning “fertilizer for sunflowers”are not selected.

Thus the whole agglomerate of search terms is selected which can besubsumed to “flowers”. Sometimes however the user does not want toinclude all NTs into a search process. If a user for example has severalflowers, he might search for different types of fertilizer of flowersapart from special fertilizer for sunflowers, which he does not have. Toexclude this aspect he has to query the NTs and avoid all search termshaving to do with “sunflowers”.

Limitations according to the invention enable the user to defineconstraints not concerning the subject to optimize the results of thesearch process considering the set conditions as illustrated in FIG. 17.

Only search terms and document profiles fulfilling the conditions areselected and displayed by the invented method.

The conditions are document-related. They usually reduce the number ofrelevant document profiles and thus the number of connected search termsselected.

Constraints not concerning the subject can be for example the documenttype and characteristics like source, language or price.

Constraints not concerning the subjects can be dropped during the searchprocess, which increases again the number of relevant document profiles,and thus the number of connected search terms selected.

The invention comprises moreover the action “combine” using thecombining relation.

Combining relations define sets of document (profiles), eithercontaining a combination of search terms (including combination,corresponding to the Boolean operator “AND”) or containing one searchterm but not the other (excluding combination, corresponding to theBoolean operator “AND NOT”).

The connection of two search terms is implemented via a document profileas illustrated in FIG. 19.

Combining relations are search term related. If the user chooses a setof search terms and executes the “combine” action according to theinvention the number of the document profiles relevant for the search isreduced because only those profiles are further considered beingconnected to the chosen search terms. Thus, the number of relevantsearch terms is reduced as well, for only search terms are furtherconsidered which are contained in the relevant set documents profilesdefined in the step before. By the described action, the user definesconstraints concerning the subject.

The action “combine” is performed by two main steps. On selection of asearch term (search term 1) or a search term set (search term set 1) allsearch terms are selected and displayed to the user by the methodaccording to the invention which are contained together with search term1 or search term set 1 in the search text of the same document (step 1).

Then the user can choose search terms to be considered in the followingsearch process (include them). Consequently, only those documentprofiles are further considered containing as well search term 1/searchterm set 1 as well as the included search terms (step 2 a).

The action enables the user to stress a second aspect.

Instead of step 2 a the user can choose search terms not to beconsidered in the following search process (exclude them). Consequently,only those document profiles are further considered containing searchterm 1/search term set 1 and not the included search terms (step 2 b).This action enables the user to exclude a second unwanted aspect oftencorrelating with the first aspect.

The actions “combine”, “include” and “exclude” according to theinvention are illustrated by FIG. 20 to 27.

FIG. 20: Search term 1 should be combined to others.

First, the method selects document profiles connected to the searchterm/containing the search term, which fulfil the (probably) definedconstraints not concerning the subject (hatched areas in FIG. 20). Theyare therefore relevant.

All document profiles connected to search term 1 are blocked for thesearch process and no more relevant (white, crossed out documentprofiles in FIG. 20).

The method according to the invention keeps the combination asconstraint concerning the subject. Unlike a constraint not concerningthe subject it cannot be dropped, that means, all search object selectedlater in the process have to meet the condition defined by thecombination. It can only be dropped by a restart of the search process.

Afterwards the system selects additional search terms also beingconnected with/contained in the relevant document profiles (dotted andhatched elements) and displays them in the output field (dottedelements) as shown in FIG. 21.

The user can choose search term 2 from the list of selected documents ofFIG. 21 and include it for the following process. The system blocks alldocument profiles not connected to search term 1 and search term 2 forthe further search process, as depicted in FIG. 22.

To put it by other terms:

Relevant document profiles are now hatched and dotted elements of FIG.21 containing search term 1 as well as search term 2.

Search terms not connected with relevant document profiles are notrelevant for the following search steps (white, crossed out search termsin FIG. 22).

Only document profiles (also) connected to relevant documents arerelevant for the further search (e.g. document profile 3 in FIG. 22).

Search term 1 is connected to an irrelevant (1) and a relevant documentprofile (3). Search term (3). It represents for the further search onlythe relevant item (3), the irrelevant (1) should not rendered to theuser.

FIGS. 23 and 24 illustrate the procedure to combine a set of searchterms with a search term.

In the following, the user wants to combine a set of search termsconsisting of search terms 1–3 (set 1) with other search terms. The samesteps performed as above now have to be done for a set of search terms.Set 1 is displayed in the output field at the beginning of the firststep as depicted in FIG. 23.

Then document profiles are blocked which are not connected to a searchterm of set 1, consequently not containing at least one of the searchterms 1 to 3 as depicted in FIG. 23.

As soon as the user selects search term 2 to exclude it from furtherprocesses all document profiles which contain search term 2 or which donot contain set1 are blocked (crossed out elements of FIG. 25) forfurther search processes.

To put it by other terms:

Relevant document profiles are now hatched elements or elements beinghatched and dotted containing search term 1 and not search term 2.

Only search terms connected (also) to relevant document (-profiles) arerelevant for further search processes. All search terms connected onlyto blocked document (-profiles) are irrelevant.

Search term 1 is connected to an irrelevant and to a relevant document(-profile). It represents in further search process only the relevant;the irrelevant must not be rendered to the user.

Then again the method selects search terms which are at least combinedwith one search term not belonging to the search term set and thereforeappearing in the same document (profile) (the hatched and dottedelements in FIG. 25). The found search terms (dotted) are displayed inthe output field (FIG. 26).

The user chooses search term 5, as depicted in FIG. 26 to include it.The method blocks all document(s) (profiles) not connected to searchterm 5 and one of the search terms 1–3. The hatched and dotted elementsare relevant for further search and the search terms 3, 5 and 6, whichare connected to them. Search terms 1 und 2 which cannot be connected tosearch term 5 are no more relevant for further search as well as searchterm 4.

If the user chooses search term 5 to exclude it from the search process,document (s) (profiles) are blocked which contain this search term or donot contain any search term of the search term set. All document (s)(profiles) connected only to blocked elements are not relevant forfurther search, as depicted in FIG. 27. Only search terms (also)connected to relevant document (s) (profiles) are relevant.

The action “combine” can (as all actions of the invention) be repeatedso that a result of an action can be used for the next action. Thus,Boolean operations of three and more terms can be generated.

The same effect is generated if each term1 respectively search term set1are combined with several search objects. In FIGS. 20 to 27 the user hadto choose several of the dotted search terms. Then further document (s)(profiles) had to be blocked containing these search terms (exclude)respectively not containing them (include):

The actions of the invention are run in the following order as depictedin FIG. 28.

First prelimitations are performed. Then successive actions of detailing(named “detail”) are executed accompanied by the actions “limitate”,“enlarge”, “generalize”, “specialize” and “combine” in any order.Finally, search sentences are displayed form which items are chosen toreceive document profiles.

The user selects results rendered by an action to subject them to thenext action.

Document profiles are stored in a data base which is—according to theinvention—queried indirectly via databases storing the search terms. Thesearch terms function as intermediate retrieval for the retrieval ofdocument profiles.

As alternative to the invention the document profile data base can alsobe queried directly via a user front end (=direct search, see rightarrow in FIG. 28).

By the invention, the user is enabled to move free in the semanticspace. At any time the user can manipulate the number and quality ofconsidered topics or aspects (“enlarge”, “generalize”, “specialize” and“combine”) or go into details (“detail”) as illustrated in FIG. 28, 30.In any situation, the invention supplies predefined search terms to theuser to support his articulation what he is searching for so that hedoes not need to formulate input. Therefore, a passive knowledge ofterminology of the searched subject is sufficient.

Moreover, the overviewing search mode is at disposal as well to searchdocument profiles.

It uses hierarchical directories connected to the document profiles andcorresponds to a classification system. The first level is implementedin form of a matrix, the next levels in form of one-dimensionalbranching structures (see FIG. 31 after selection of matrix field“tools/labour market, human resource” a connected branching structurehas been displayed).

Each class or directory is defined by a administrator on a sever systemand therefore standardized. The standardized structure can be alternatedon a client system.

As indicated by the name the user is supposed to get quick and clear butnot very special information just to get an overview of a certainsubject. Correspondingly information is delivered not being to specialbut popular for an average user. The mode can be compared to skimmingthrough a newspaper.

Client and server use the same directories so that a user can easilyupdate his client system (“update results”) and transfer newsubdirectories and connected document profiles from the server to theclient. He can easily repeat the same search procedure by searching inthe same directories.

The problem oriented search mode is a special form of the overviewingsearch mode. Both have hierarchical structures implemented bydirectories defined by an administrator in common. An example isillustrated on FIG. 32 (“costs of distribution and marketing”) and FIG.33. (subdirectory).

The problem oriented search mode however differs from the overviewingsearch mode in summarizing directories associated by the subject,depending on each other or influencing each other as “problem chains”being presented to the user. Such a structure is illustrated by nodesand arrows.

Problem chains can be connected by search terms used in the specialisedsearch mode or directories from the overviewing search mode; an examplecan be seen in FIGS. 32 and 33.

The problem oriented search mode intends to give a systematic overviewof a certain subject to a user and guide him to notice certain aspectsin a certain order. Hence, he receives a kind of checklist or projectplan, which prevents him from failing or omitting important topics.

Problem chains are offered for complex subjects whenever getting asystematic overview of the subject is crucial before getting intodetails.

In the following procedure of the specialised search mode according tothe invention is described.

The main characteristics are the architecture of the method according tothe invention (data base design, retrieval procedures) and theinteraction with the document management system.

In the following “document”, “document profile” and “result” are used assynonyms.

The basic idea of the method according to the invention is the “apertureprocedure” that means the successive revealing of growing parts of acomplete text (the over-all text of a document) by means of textextracts of the over-all text (=search term) during the search process.The smallest part to be revealed is a search word, the most considerablea search sentence

The background of the invention is that the user is enabled to changethe search strategy and the direction of a search process while it isrunning. He can successively refine the search and influence the resultsearlier than through other methods. He is supported by easy readablehints (search terms instead of whole documents).

As the retrieval structure is related to the document, it is possible tocopy parts of the structure to a client system handling only subsets ofall documents and search terms available on the server, still fulfillingthe complete function.

There are intersections of the invention with classification systems onthe one hand and with search engines with automatic indexing and keywordsystems on the other hand.

The classes of a classification system correspond to the search term ofthe invention, which are connected by detailing relations and thethesaurus relations subordinating relations and superordinatingrelations. FIG. 34 illustrates a classification system according to thestate of the art.

FIG. 35 depicts the invention's section model illustrating thesimilarity of classification systems and the invention.

Both can be considered to have a hierarchical search structure. The usermoves along a path form one hierarchical level to the other; the levelsare connected. The paths function as a guide so the user does not needto formulate query strings. Going down the hierarchical search structurethe user can narrow the range of subjects and amount of results.

The differences between the invention and classification systems are:

Classes as representatives of the documents during the search are namedabstract from the documents. According to the invention, the searchterms as representatives of the documents during the search are derivedfrom the document or from themselves by extracting them from thedocument. The have linguistic-substantial subset relations (detailingrelation) to each other and to document profiles.

The search terms of the invention are generated automatic/semi-automaticby the document management system, whereas the classes of theclassification system are formed “intellectually” by an administrator.Similarities can also be found with the information zooming of thetopic/topographic system, in which the user sees projections of thesearch results (“text condensates or -surrogates”) being rather abstractfrom the documents. The advantage of the extraction of search termsaccording to the invention compared to the text condensation oftopic/topographic is the following: It can be automated but neverthelessis a precise method to index documents (corresponding to the process offorming classes and assigning documents to it in case of classificationsystems). Classification systems make mistakes if using automaticindexing, which can be improved by increasing the fault tolerance bydecreasing the amount of classes or by manual corrections. Theextraction according to the invention does not need manual corrections(in case a stock of reference search term is available). Moreover, thesearch terms present a very precise classification.

The classification of a classification system exists independently ofthe search results. Setting up classes and assigning documents to themare two separate steps. Classes are abstract from the search results.That means that connections between classes and search results as wellas between classes themselves are static, fixed and independent of therelevance of individual search results determined by constraints. Thatmeans a class is presented to the user regardless if relevant documentsare assigned to the class.

In contrast, the creation of the search terms according to the inventionis done simultaneously with assignment of documents to it. Search termscan only coexist with search terms and therefore they are related. Theyare only presented to the user if the method according to the inventionretrieves results connected to them

The displayed or relevant search terms are therefore always a functionof the results connected to themSearch term_(displayed) =f(result_(connected)).

Therefore, the relevance of the search terms depends on the relevance ofthe connected results. In turn these depend on constraints related tothe subject (defined by combinations according to the invention) orconstraints not related to the subject (defined by limitations accordingto the invention) defined by the user during the search process.

Therefore, the relevant search terms are a function of the constraintsfor the results:result_(connected) =f(constraint for the result).

Therefore, the relevant or displayed search terms are a function ofconstraints:Search term_(displayed) =f(constraint for the result).

According to the constraints within the invention (in opposition to aclassification system) a set of search results is selected from adatabase relevant for the search as well as relevant search termsconnected to the results and the search terms are presented to the user.Connections of search terms are dynamically activated depending on theconstraints during the search process. Hence they are not existing apriori like classes of a classification system. Transferred to a tree ofa classification system that means: not all directories are revealed tothe user, but only those which are relevant concerning the constraint asillustrated in FIG. 36.

Keyword systems and the invention are compared in the following,illustrated by FIGS. 37 and 38.

The model of a state-of-the-art keyword system is depicted in FIG. 37.

A part model of the invention illustrating intersections with a keywordsystem is depicted in FIG. 38.

Both methods extract parts of the original text (see big arrow in FIG.37), stored as objects in a data base and connected to search results(see vertical, thick lines in FIG. 37).

Both methods have in common that the text parts show extracts of thefull text of different sizes (keywords and search words are shortextracts, indexed noun phrases and search sentences are long extracts).

However differences of both methods are:

A keyword system usually comprises only relations between text extractsand documents, but not between text extracts themselves. Some systemsuse the above mentioned thesaurus relations, but these are onlysubsidiary and give hints to reformulate or extend a query (e.g. queryextensions). They are not related to particular documents but existindependent of documents (see thick horizontal arrows in FIG. 37).

As a consequence the user gets the search result directly afterformulation of a keyword. If he wishes to change the search strategy, hehas to restart and formulate a new expression (with some systemsemploying relevance feedback the system itself reformulates the searchexpression on the basis of documents preferred by the user).

The search procedure has a single beginning (formulated query) and atarget (result list) without any intermediate stages, as illustrated inFIG. 39.

The user can be compared to a golf player who has just one stroke toplace the ball into the hole. After the stroke, he has to search quitelong where he has hit the ball (metaphoric for the long result lists hesometimes has to look through). If he missed the target, he has to goback where he started and start again. Whether he hits the next time isalso a question of what he learned from the first stroke.

According to the invention, nested text extracts of different length aretaken from the original text and not only connected to the results, butalso to each other. All text extracts (search terms) are stored in adata base in a manner that makes them retrievable as chains which linkone text extract to another in which it is contained, as illustrated inFIG. 40.

Additionally relations to equivalent text extracts of other results andto the results themselves are generated and added to the chain (see FIG.41). Search terms related to the same results display as lowest commondenominator text extracts appearing in both results. Therefore,complexity and size of content representation of results is reduced.

By searching, the user moves along the chain from one text extract tothe next until he reaches the search result which is connected to thelast link (if he does not abort the search process before). During sucha search process, the user is able to view longer and longer textextracts from the documents of the result list.

By using this method he can change the search strategy according to theknowledge he acquired from the intermediate results (intermediate of thechain).

His search path has a start (selected short text extract/search term a),a target (search result) and in between there are intermediate results(text extracts of different length/search terms b–c, which are connectedto the search results as well as to the short search term firstselected), as depicted in FIG. 42.

The situation of the user can now be compared to that of a golf playerin reality. He has several strikes not being forced to hit by onestrike. He can adjust the direction of the strikes (analogous: thesearch strategy) according to the intermediate results (position of theball after the first strike respectively related search terms), bychoosing certain search terms.

During the complete search process and at all actions lists of relevantsearch terms are presented to the user so that he never has to formulatea query. Unlike as in keyword systems where he has to do that.

Some systems make propositions by a thesaurus, but they are related tothe whole vocabulary of a system, not to keywords being connected torelevant search results and to relevant intermediary steps/search terms.Hence, it can happen that a user chooses two entries of a thesaurus andcombines them although there is no result containing both terms.

After having explained the invention theoretically so far now, apractical example should be presented. FIG. 43 depicts a preferredsystem environment. The complete system consists of a documentmanagement system (100) and a retrieval system (110).

Within the document management system text documents (102) are processedby means of a document management program (104) and reference databases(106) automatically or semi-automatically under control of anadministrator (108) and stored in databases in a form accessible by aretrieval program according to the invention and viewers (e.g. internetbrowsers). The retrieval system (110) renders references to textdocuments (120) requested by the user (118) according to his searchactions.

The document management system (100) processes information from textdocuments concerning search objects and generates reference data bases(106) while a part of their content serves as a base of the persistentdata storages of the invention (112).

The user (118) accesses the data storages (112) by means of a preferredprogram (114). Viewer programs (116, esp. HTML-Browser) support.

The invention can be run on a decentralized local stand-alone system aswell as on a central client/server system and retrieve internal andexternal information.

In the following, the data model of the method for retrieval accordingto the invention is explained:

The data objects of the invention are:

1. Search terms (search objects)

a. search words

b. compounds

c. noun phrases

d. search sentences

2. document profiles

3. documents

The objects have various relations:

1. detailing relations

2. thesaurus relations

a. subordinating relations

b. superordinating relations

c. associating relations

3. combining relations

FIG. 44 depicts a corresponding entity relationship model for thedetailing relations according to the invention.

The relation comprises two basic rules:

There can only be a single search path between two search terms.

It should comprise as many search terms as possible and thus be as longas possible.

FIG. 45 gives an example:

A search word must not be connected to a noun phrase directly and inaddition indirectly via a compound entailing two parallel relation pathsbetween search word and noun phrase. The shorter relation is dropped, sothat there is only one detailing relation between search word and nounphrase left, as depicted in FIG. 46.

FIG. 47 depicts a corresponding entity relationship model for thesubordinating relation according to the invention, and FIG. 48 acorresponding entity relationship model for the associating relationaccording to the invention.

FIG. 49 depicts a corresponding entity relationship model for thesuperordinating relation according to the invention and FIG. 50 acorresponding entity relationship model for the combining relationaccording to the invention. FIG. 51 b is the extension of FIG. 51 a.Both depict an attribute model of the data model according to theinvention.

FIG. 52 depicts a legend for FIGS. 51 a and 51 b. It should be noticedthat each attribute is at the same time a primary key.

FIG. 53 depicts a directory of preferred attributes.

In the following search, objects are connected in the data baseaccording to the pattern (ST=search term):

ST1+relation (ST1−ST2)→ST2, which means that data on the relation(ST1−ST2) is stored in the record of ST1, which is the starting pointfor a retrieval of ST 2, which is related to ST 1 by any relationaccording to the invention.

As an alternative the implementation ST 1→ST2+relation (ST1−ST2) isfeasible as well entailing that the data on the relation is stored inthe record of ST 2, which is the target of a retrieval of ST 2, which isrelated to ST 1 by any relation according to the invention.

The preferred system employs several data storages (double marked areasin FIG. 51 a and 51 b). All data is stored in persistent storesimplemented as databases or as structured text files.

(Annotation: in the following a datastorage is defined to be persistentit is is not defined to be temporary).

Bigger systems with multi-user access to central data storagesfunctioning as servers in a network typically employ databases, smallerdecentralized systems working as clients usually employ files.

In data bases [interest_area] and [Doc_cl] function either as attributeor a distribution parameter to address the right data storage.

The retrieval program can either address external data storages in caseexternal data are retrieved or internal data storages in case archived,internal data are retrieved. The retrieval program addresses the rightdata storage by a user-defined storage parameter [search status].

In the following, the structure of a search list file according to theinvention is illustrated by FIG. 54. The search list file contains theobjects search words and compounds including synonyms in alphabeticalorder. FIG. 54 is a depiction in form of a table.

The legend for FIGS. 54 to 59 is:

underlined: attributes function as primary key in data storages.

(brackets): attributes being sort keys or distribution parameter of datastorages.

The search list according to FIG. 54 contains data which are not muchchanged by the time. For each bigger subject area there is a search listfile containing all search words and compounds of the subject area. Itis stored on the client. The external search list file (for external notarchival information) is updated at the beginning of every searchprocess, the internal search list file is updated at the beginning ofevery archiving process.

The search list file contains all data to select the search objectssearch words and compounds on a local system.

The search list file functions as thesaurus store during thepreselection and can be looked up to avoid formulation of search terms.Synonyms have the same ST_ID (id of search term and primary key) and canbe used as surrogates.

A search list file will be updated before starting retrieval.

A preferred search list file comprises following characteristics:

Sort records: by ST_Name distribution of data on datastores: byinterest_area (oblig.) format: structured file amount: 1 per subjectarea (interest_area) user interface for retrieval: search view transferof data to client system: before search process (preselection)

FIG. 55 illustrates the structure of a thesaurus database/file accordingto the invention. It contains all search terms without synonyms asobjects.

The thesaurus database supports the main selection.

The only parts of thesaurus database/-file enabling local retrieval ofinternal (archived) information are stored on the client. It contraststhe search list file, which contains as well search terms connected todocuments not stored in the local system.

In contrast to the search list file records of the local of thesaurusdatabase/-file are not updated before the search process starts and onlyif they are used after download and archiving of a document.

A preferred thesaurus database comprises the following characteristics:

Sort records: by ST_Name distribution of data on datastores: byinterest_area (oblig.) format: database / structured file amount: 1 persubject area (interest_area) user interface for retrieval: search viewtransfer of data to client system: at archiving

FIG. 56 illustrates the structure of a resource database/-file accordingto the invention. It contains the identifiers (ids) of all search termsand document profiles related to a document.

The resource database/-file is a distributing center for alldatabases/files and generates a connection between document and documentprofiles.

It has two functions:

On the one hand, it is used for the action “combine” to select searchterms contained in the same document profiles. On the other hand, itsupplies the server information about search terms, which have to betransferred to a client after a download for archiving the document, sothat the search process can be repeated there.

The resource database contains the document class [Doc_cl] of a documentas distribution parameter. For the transfer of records to the client thesame rules apply as for the thesaurus database.

A preferred resource database comprises following characteristics:

Sort records: by Doc_cl, doc_id distribution of data on datastores: bysearch status (oblig.), Doc_cl (fac.) format: database / structured fileamount: 1 user interface for retrieval: — transfer of data to clientsystem: at archiving

FIGS. 57 and 58 illustrate the structure of a index database/-fileaccording to the invention. It contains the document profiles. FIG. 57depicts the document profile of an expert article in form of a table.

Document profiles are displayed on a viewer, displaying either one ormore document profiles within a window (e.g. an internet browser forHTML documents or any text editor for text documents, see example inFIG. 58).

A preferred index database/-file comprises following characteristics:

Sort records: by Doc_cl, doc_id distribution of data on datastores: bysearch status (oblig.), Doc_cl (fac.) format: database / structured fileamount: 1 user interface for retrieval: viewer according to the format(e.g. browser) transfer of data to client system: at archiving

The document itself is directly downloaded as file from a server orselected from a database. FIG. 59 depicts a document database or file.

A preferred document database comprises following characteristics:

Sort records: by Doc_cl, doc_id distribution of data on datastores: bysearch status (oblig.), Doc_cl (fac.) format: database / structured fileamount: 1 user interface for retrieval: viewer according to the format(e.g. browser) transfer of data to client system: at archiving

In the following, the user interfaces and the temporary data memoriesare illustrated by FIG. 60.

The retrieval program keeps parts of search objects (rendered attributesets, selection attributes) in temporary data memories as so-called“views”. A view comprises a user interface, temporary data memories andappropriate interfaces.

The user interface depicted in FIG. 60 is used for the preselection andthe main selection and comprises an input field, an output field andseveral buttons to activate various search actions.

The results of each action (=rendered attribute sets, see below) areselected from the addressed persistent data storage and loaded throughinterfaces to the temporary data memory of a view in the same order asthey were selected.

The visible attribute sets—parts which are relevant for the user (framedparts in FIG. 60) are displayed.

Now the user can mark some of the displayed search terms and thusinvolve them into the next search action. Alternatively, he can alsodelete some and mark the rest.

The selection attributes which are relevant for the action and werestored temporarily in the search view, are transferred to the persistentdata storage for the selection required by the next search actiondefining selection qualifiers.

The user can control the position of the part of the search list, whichis visible in the output field by the input field (listbrowsing). Theposition is set by the system so that items beginning with the inputstring are visible.

The search status and the subject area (see FIG. 61 “searchedinformation”) are defined in the limitation view at the preselection.

In case external information is required (“new information”) the systemupdates the local search list file of the chosen subject area.

At any time of the search process a change of the parameters “searchstatus” (“searched information” see FIG. 61) and “subject area”—whichmust be defined by the user—sets off a new search process starting againwith the preselection.

As soon as search status and interest_area are defined by the user themenus “limitations” in FIG. 61 are displayed and can be activated by theuser.

Items below these obligatory selection fields define the document class(Doc_cl) and define the constraints not related to the subject.

They can be defined during the whole search process.

In the following, the function of the method according to the inventionis illustrated on the basis of a functional model. FIG. 62 depicts anoverview of the processes of the search for external information.

The following rules are valid for steps 1 to 4 of FIG. 62 (preselection,main selection, final selection and archiving):

1. preselection

→ initial status:

retrieval program started, limitation view opened

Definition of relevant search list by search status and subject area inthe limitation view

display of relevant search words and compounds in the output field ofthe search view

← final status:

list of relevant search words and compounds in the output field of thesearch view

2. main selection

→ initial status:

list of relevant search words and compounds in the output field of thesearch view

successive selection of search terms and relevant document profilesthrough several search actions

← final status:

selected document profiles displayed in a document profile viewer

3 final selection

→ initial status:

selected document profiles displayed in a document profile viewer

selection of document profiles and document displayed in a documentviewer

← final status:

document loaded

4. Archiving

→ initial status:

document loaded, search for external information

transfer of all used search terms to the client system

in case of a client/server-system the retrieval program stores theexternal (server side) search objects and documents in the precedingsteps only temporarily, these are transferred and stored to the clientat archiving using a client-dependent format.

→ final status:

transfer finished

FIG. 63 depicts an overview of the processes of the search for internalinformation.

If internal information is searched, the process of archiving is notperformed, as all objects are already stored on the client system.

FIG. 64 depicts a functional model giving an overview of the processesof a server-search.

The “server-search” is a procedure according to the state of the art notemploying the program according to the invention. In this procedure, theclient computer accesses directly the server interfaces. Thecommunication of the server databases is executed by a server interfacegenerating the user interface on the client at a session. For the sakeof performance, the preselection is not employed.

The procedure starts with the action “limitate” of the main selection.Then the user has to input a string in the input field being a requiredvalue for the selection qualifier [ST_Name] for a selection in thethesaurus database/-file. If a record is selected, it is transferred tothe search view, if not an error message is displayed.

In the following the procedures of the retrieval according to theinvention is illustrated by data flow diagrams (process specification)in FIGS. 65 to 68. The legend of FIGS. 65 to 68 is depicted in FIG. 69.

FIG. 65 illustrates the preselection.

FIG. 66 depicts the main selection, FIG. 67 the final selection and FIG.68 the archiving.

Each is an program flow chart having the following denotations:

The conditions of transition from one process to the next are bold, theentry from the previous process and the start of the program are markedby a filled circle, the exit and the re-entry of the next process aremarked by a black filled square standing on the edge. The rest of thesymbols are explained in FIG. 69.

Intermediate processes do not entail new results for the user. They arejust interactions without any involvement of the user.

Arrows pointing to a set of alternative processes apply to each singleprocess.

Incoming arrows pointing to single processes are applied instead of theincoming arrows pointing to the set of processes

Outgoing arrows pointing to single processes are applied instead of theoutgoing arrows pointing to the set of processes

Data flows are marked by thin drawn through lines with black arrows,control flows are marked by dashed lines with black filled arrows.

The invention employs the following data objects, which are defined asfollows:

record:

complete record in persistent data storage

rendered search list attribute sets:

parts of records which have been selected from a search list file by thesystem which are temporarily stored in the search view.

They contain the attributes:

[ST_Name], [context] [ST_ID], [NT], [RT], [BT], [Con_K].

rendered thesaurus attribute sets:

parts of records which have been selected from a thesaurusdatabase/-file which are temporarily stored in the search view.

They contain the attributes:

[ST_Name], [context] [ST_ID], [NT], [RT], [BT], [Con_K], [Con_B],[Con_S], [Con_D].

visible attribute sets:

parts of attributes ([ST_Name], [context]) of rendered search listattribute sets and rendered thesaurus attribute sets which are displayedin the output field.

input string:

input of user in input field to navigate the list visible attributesets.

selection attributes:

attributes of rendered thesaurus attribute sets of chosen search termsinvolved in a certain action. They are read record by record and theirvalues transferred to the appropriate data storage as selectionqualifier. All records are selected fulfilling the condition:[selection attribute]of temporary memory=[selection qualifier]ofpersistent data storage

The following table gives an overview of all search actions andselection attributes:

selection action attributes: data storage selection: selection qualifierlimitate, reload [ST_ID] TH_DB:[ST_ID] specialize [ST_ID], [NT]TH_DB:[ST_ID] enlarge [ST_ID], [RT] TH_DB:[ST_ID] generalize [ST_ID],[BT] TH_DB:[ST_ID] detail (compounds) [ST_ID], [Con_K] TH_DB:[ST_ID]detail (noun phrases) [ST_ID], [Con_B] TH_DB:[ST_ID] detail (searchsentence) [Con_S] TH_DB:[ST_ID] detail (document_profiles) [Con_D]IX_DB/-datei:[Dok_Prof_ID] combine [ST_ID](a) RES_DB:[ST_ID/Doc_Prof_ID][ST_ID](b) TH_DB:[ST_ID] include / [ST_ID](b) RES_DB:[ST_ID/Doc_Prof_ID]exclude [ST_ID](c) TH_DB/-datei:[ST_ID] legend of above table: TH:thesaurus RES: resource IX: indexselection qualifier for retrieval:facultative: distribution parameters of data storages or sort keysobligatory: identifiers, primary keysprogram parameters:notation: [data/data storage], ([parameter/parameter value/condition])the phrase in brackets specifies the relevant data/data storage.search status:parameter (values: internal/external) for addressing a data storage.internal: data storages are addressed storing internal data.external: data storages are addressed storing external data.client:

Identifier assigning a certain client-related data storage having acertain format for the updating procedure of the search list.

interest_area:

see attribute model (FIGS. 51 a and 51 b)

Doc_cl:

see attribute model (FIGS. 51 a and 51 b)

create_date:

creation date of a record

characteristics of parameter:

set in ordinary letters: obligatory selection qualifier or definition ofparameter

set in italics: optional distribution parameter

underlined: parameter to address a data storage

databases/files (persistent data storage):

persistent data stores run on the client computer (stand-alone-system)or on external computers(=server) (client/server-system).

source storage system/source storage:

external data storage system (e.g. a file system or a databasemanagement system) containing the external persistent data storages andtransferring data to corresponding internal persistent data storagesduring archiving.

target storage system/target storage:

internal data storage system (e.g. a file system or a databasemanagement system) containing the internal persistent data storages andreading and storing data at archiving from corresponding externalpersistent data storages.

components of the retrieval program:

memories: temporary memories implemented on the client computer

interface:

system component controlling the data exchange between temporary andpersistent data storages, supporting and controlling the temporarystoring of data.

limitation view:

consists of a user interface for displaying and defining constraints notconcerning the subject and an interface defined above.

search view:

user interface for displaying and choosing search objects and aninterface defined above.

external components:

doc_profile_viewer:

editor/viewer for document profiles (e.g. text editor, text processingprogram, HTML-browser)

document_viewer:

editor/viewer for documents (e.g. text editor, text processing program,HTML-browser)

Each step of the retrieval process according to the invention isillustrated by the following process specification:

1.1 preselection

→ initial status:

retrieval program started, limitation view opened

menu items of limitation view are selected by user

← final status (search status=internal)

search status, interest_area, Doc_cl defined, command “start/proceedsearch” activated.

← final status (search status=external):

search status, interest_area, Doc_cl defined, command “start/proceedsearch” activated.

1.2 search list update

→ initial status:

search status=external, interest_area defined

The search list file (external, interest_area) is updated by an searchlist update file (external, interest_area)

← final status:

search list file updated

1.3 search list selection

→ initial status (search status=internal): search status, interest_area,Doc_cl defined, command “start/proceed search” activated.

→ initial status (search status=external):

search status, interest_area, Doc_cl defined, 1.2 finished, command“start/proceed search” activated.

The search view is started. The search terms are selected from thesearch list file (interest_area, search status) by Doc_cl as selectionqualifier. The rendered attribute sets are transferred to the searchview and the visible attribute sets are displayed in the output field.

← final status: The rendered attribute sets transferred to the searchview, visible attribute sets displayed in the output field.

2. main selection

2.0 choice

→ initial status:

visible attribute sets displayed in the output field.

The user chooses search terms in the output field he wants to involve inthe next search action. In order to do that he marks the items line byline. Items can also be deleted and the residual is chosen. If no itemis chosen, all (remaining) items are considered to be elected.

← final status:

search terms chosen

basic process of main selection

→ initial status:

search terms chosen, command (action) activated, no selection attribute(action) empty

the retrieval system reads the selection attribute of the elected searchterms from the search view, selects search terms (selection qualifier:selection attributes, [Doc_cl] (=obligatory), [interest_area](=facultative)) from the thesaurus database/-file (search status)transfers the rendered attribute sets to the search view and displaysthe visible attribute sets in the output field.← final status:search terms elected

rendered attribute sets transferred to search view, visible attributesets displayed in the output field.

2.1 limitate=redefinition Doc_cl+basic process

The user enters data into the limitation view to define Doc_cl.

Then the basic process is performed.

command (process): “start/proceed search”.

selection attribute (process)=[ST_ID]

Annotation: if interest_area or search status are changed the searchprocess is restarted. → 1.1 preselection

2.2.0 Combine

→ initial status:

search terms elected, command: “combine” activated.

side condition:

all other actions deactivated

The selection attributes (a) are read from search view and doc_IDs ofdocument profiles are selected from the resource database/-file in whichthe chosen search terms are contained. The ST_IDs of search words (W)and compounds (K) which are assigned to the same Dok_ID are transferredto the search view and defined as selection attributes (b).

The retrieval system reads from search view selection attributes[ST_ID](b), selects from thesaurus database/-file (search status) searchterms (selection qualifier: selection attributes (b) [Dok_cl](=obligatory), [interest_area] (=facultative). The rendered thesaurusattributes are transferred to the search view, visible attribute setsare displayed in the output field.

← final status:

rendered attribute sets transferred to search view, visible attributesets displayed in the output field.

2.2.1 Include

→ initial status:

2.2.0 finished, search terms elected (selection attributes=[ST_ID](b))

command: “include” activated.

side condition:

all other actions deactivated

The selection attributes [ST_ID] (b) are read from search view anddoc_IDs of document profiles are selected from the resourcedatabase/-file in which the elected search terms are contained. TheST_IDs of search sentences (S) which are assigned to the same Dok_IDs asselection attributes (a) and (b) are transferred to the search view anddefined as selection attributes (c).

The retrieval system reads from search view selection attributes (c),selects from thesaurus database/-file (search status) search terms(selection qualifier: selection attributes (c), [Doc_cl] (=obligatory),[interest_area] (=facultative). The rendered thesaurus attributes aretransferred to the search view, visible attribute sets are displayed inthe output field.

← final status:

rendered attribute sets transferred to search view, visible attributesets displayed in the output field.

2.2.2 Exclude

Θ initial status:

2.2.0 finished, search terms chosen (selection attributes=[ST_ID](b)),

command: “exclude” activated.

side condition:

all other actions deactivated

The selection attributes [ST_ID] (b) are read from search view anddoc_IDs of document profiles are selected from the resourcedatabase/-file in which the chosen search terms are contained. TheST_IDs of search sentences (S) which are assigned to the same Dok_IDs asselection attributes (a) and not (b) are transferred to the search viewand defined as selection attributes [ST_ID] (c).

The retrieval system reads from search view selection attributes [ST_ID](c) and selects from thesaurus database/-file (search status) searchterms (selection qualifier: selection attributes (c),[Doc_cl](=obligatory), [interest_area] (=facultative). The renderedthesaurus attributes are transferred to the search view, visibleattribute sets are displayed in the output field.

← final status:

rendered attribute sets transferred to search view, visible attributesets displayed in the output field.

2.3 specialize=basic process

command (process): “specialize”.

selection attributes (process)=[ST_ID], [NT]

2.4 enlarge=basic process

command (process): “enlarge”.

selection attributes (process)=[ST_ID], [RT]

2.5 generalize=basic process

command (process): “generalize”.

selection attributes (process)=[ST_ID], [BT]

2.6 detail=basic process

command (process): “detail”.

selection attributes (process)=[ST_ID], [Con_K]

2.7 reload=basic process

command (process): “detail”.

selection attributes (process)=[ST_ID]

→additional initial status:

selection attribute [Con_B] not defined

2.8 detail(noun phrases)=basic process

command (process): “detail”.

selection attributes (process)=[ST_ID], [Con_B]

→additional initial status:

selection attribute [Con_B]=defined

selection attribute [Con_K]=empty

2.9 detail(search sentences phrases)=basic process

command (process): “detail”.

selection attributes (process)=[Con_S]

→ additional initial status:

selection attribute [Con_S]=defined

selection attribute [Con_K], selection attribute [Con_B] defined andempty

2.10 detail(document profiles)

→ initial status:

search terms chosen,

command: “detail” activated.

selection attribute [Con_D]=defined and not empty

selection attribute [Con_K], selection attribute [Con_B]=defined andempty

The retrieval system reads from search view selection attributes[Con_D], selects from index database/-file document profiles (selectionqualifier selection attributes [Con_D] (=obligatory), [interest_area](=facultative). The document profiles are opened in a viewer.

← final status:

document profiles opened in document profile viewer

3. end selection=detail(documents)

→ initial status:

document profiles opened in document profile viewer

The user chooses a document in the document profile viewer and pressesthe button “Doc_V”. The document is opened as file or is selected from adatabase/-file and is opened in a viewer.

← final status:

documents opened in document viewer

4. Archiving

→ initial status:

search status=external, 3 finished

The [doc_ID] is transferred to a client-related external resourceDB/-file of the target data storage and the ST_IDs and Dok_Prof_IDs ofsearch terms and document profiles are selected, which are contained inthe document. These are selected from the corresponding external datastorage(client)

Selection qualifier:

thesaurus database/-file: [ST_ID] (=obligatory), [Doc_cl] (=facultative)

index database/-file: [Doc_Prof_ID] (=obligatory), [Doc_cl](=facultative)

document database/-file: [Doc_ID] (=obligatory), [Doc_cl] (=facultative)

and together with the selected resource record to the corresponding datastore (client) in the target data store.

← final status:

transfer finished

In the following the control structure of the processes of the givenexample are explained by FIG. 70 and FIG. 71. FIG. 70 shows a structurediagram for the procedure of the preselection. The following parametersare valid for the shown example:

options:

1 search status=internal 2 search status=external

processes:

1.1.1 definition search status, interest_area

1.1.2. definition search status, interest_area

1.2 search list update

1.3 search list selection

FIG. 71 illustrates a structure diagram for the process control of themain selection in the given example. The related marks for processes,conditions and action options are defined as follows:

Processes

2.1 limitate

2.2 combine

2.3 specialize

2.4 enlarge

2.5 generalize

2.6 detail

2.7 reload

2.8 detail (noun phrases)

2.9 detail (noun phrases)

2.10 detail (document profiles)

conditions

1: selection attribute [Con_K]

2: selection attribute [Con_B]

3: selection attribute [Con_S]

4: selection attribute [Con_D]

action options:

1 limitate

2 combine

3 specialize

4 enlarge

5 generalize

6 detail

7 include

8 exclude

FIGS. 72 to 80 explain detailed process models of the given example ofthe invention.

FIG. 72 depicts a process model of preselection,

FIG. 73 the process model of search list update,

FIG. 74 the process model of search list selection,

FIG. 75 the process model of action “limitate”,

FIG. 76 the process model of actions “combine”, “include” and “exclude”,

FIG. 77 the process model of main selection (corresponding to steps 2.2to 2.9 of overview chart of FIG. 71),

FIG. 78 the process model of main selection (corresponding to step 2.10of overview chart of FIG. 71),

FIG. 79 the process model of final selection

FIG. 80 the process model of archiving

FIG. 81 explains these figures as a legend.

Dashed elements are related to search for external information. Attransfer of a document the system interface records the [Dok_ID]. Itsupports mapping search objects on the internal persistent data store atarchiving.

In the following the process specification is illustrated even moredetailed marking the actions of the system by “S::” and the actions ofthe user by “U::”.

1.1 preselection

-   1.1.1 U:: defines search status, interest_area in limitation view    -   S:: initiation of search list update, if search status=external-   1.1.2 U:: defines Doc_cl in limitation view    1.2 search list update-   1.2.1 U:: selection of    records(create_date(external)>create_date(internal)) from search    list update file(interest_area)-   1.2.2 S:: transferring records to search list file(interest_area)

Instead of single records, a update file containing records to beupdated for a certain time slot can be transferred.

1.3 search list selection

-   1.3.1 S:: opens search view, loads search list (search status,    interest_area), selects records (selection qualifier: [Doc_cl]) from    search list file (interest_area).-   1.3.2 transfers rendered attribute sets to search view, displays    visible attribute sets line by line in output field.-   1.3.3 U:: inputs string,    -   S:: scrolls visible attribute sets, until input string=[ST_Name]

Basic search process of main selection

-   x.1 S:: reads selection attributes of all search terms displayed in    search view line by line, selects from thesaurus database/-file    (search status) records    -   selection qualifiers: selection attributes, [Doc_cl]    -   distribution parameter: [interest_area] (=facultative selection        qualifier)-   x.2 deletes content of output field, transfers rendered attribute    sets in read order to search view, displays visible attribute sets    in read order line by line in output field;    -   deletes selection attributes apart from [ST_ID].        2.1. limitate-   2.2.1 U:: defines Doc_cl in limitation view-   2.2.2=x.1-   2.2.4=x.2    2.2*-   2.2.0 combine-   2.2.0.1 S:: reads selection attributes [ST_ID](a) of chosen search    terms displayed in search view line by line, selects from resource    database/-file (search status) records.    -   selection qualifiers: selection attributes [ST_ID](a), [Doc_cl]-   2.2.0.2 queries ST_IDs of search words (W) and compounds (K) in    selected    -   records, defines found ST_IDs=selection attribute [ST_ID](b) and        transfers ST_IDs to search view-   2.2.0.3 reads selection attributes [ST_ID](b) of all search terms,    selects from thesaurus database/-file (search status) records.    -   selection qualifiers: selection attributes [ST_ID](b), [Doc_cl].-   2.2.0.4 deletes content of output field, transfers rendered    attribute sets in read order to search view, displays visible    attribute sets in read order line by line in output field;-   2.2.1 include-   2.2.1.1 S:: reads selection attributes [STID](b) of chosen search    terms displayed in search view line by line, selects from resource    database/-file (search status) records.    -   selection qualifiers: at least 1 of selection attributes        [ST_ID](a) and all selection attributes [ST_ID](b) in        combination, [Doc_cl]-   2.2.1.2 queries ST_IDs of search sentences in selected    -   records, defines found ST_IDs=selection attribute [ST_ID](c) and        transfers ST_IDs to search view-   2.2.1.3 reads selection attributes [ST_ID](b) of all search terms,    selects from thesaurus database/-file (search status) records.    -   selection qualifiers: selection attributes [ST_ID](c), [Doc_cl].-   2.2.1.4 deletes content of output field, transfers rendered    attribute sets in read order to search view, displays visible    attribute sets in read order line by line in output field;-   2.2.2 exclude-   2.2.2.1 S:: reads selection attributes [ST_ID](b) of chosen search    terms displayed in search view line by line, selects from resource    database/-file (search status) records.    -   selection qualifiers: at least 1 of selection attributes        [ST_ID](a) and none of selection attributes [ST_ID](b) in        combination, [Doc_cl]-   2.2.2.2 queries ST_IDs of search sentences in selected    -   records, defines found ST_IDs=selection attribute [ST_ID](c) and        transfers ST_IDs to search view-   2.2.2.3 reads selection attributes [ST_ID](b) of all search terms,    selects from thesaurus database/-file (search status) records.    -   selection qualifiers: selection attributes [ST_ID](c), [Doc_cl].-   2.2.2.4 deletes content of output field, transfers rendered    attribute sets in read order to search view, displays visible    attribute sets in read order line by line in output field;    2.3 specialize=basic process-   2.3.1=x.1-   2.3.2=x.2    2.4 enlarge=basic process-   2.4.1=x.1-   2.4.2=x.2    2.5 generalize=basic process-   2.5.1=x.1-   2.5.2=x.2    2.6 detail=basic process-   2.6.1=x.1-   2.6.2=x.2    2.7 reload=basic process-   2.7.1=x.1-   2.7.2=x.2    2.8 detail(noun phrases)=basic process-   2.8.1=x.1-   2.8.2=x.2    2.9 detail(search sentences phrases)=basic process-   2.9.1=x.1-   2.9.2=x.2    2.10 detail(document profiles)-   2.10.1 S:: reads selection attributes of chosen search terms    displayed in search view line by line, selects from index    database/-file (search status)    -   records.(selection qualifier: search attribute)/loads index file-   2.10.2 opens doc_profile_viewer, loads index records in    doc_profile_viewer/opens index file in doc_profile_viewer    3. final selection    detail(documents)-   3.1 U:: chooses in doc_profile_viewer document profiles and    activates the command “Doc_V”.-   3.2 S:: selects document file from a document database (search    status)/loads document from directory    -   opens document file in document_viewer        4. archiving-   4.0 S:: selects from resource database/-file (external,client),    [ST_DB], [Dok_Prof_ID]    -   (Selection qualifier [doc_ID] (obligatory), [Doc_cl]        (=facultative)).-   4.1 transfers resource records via an interface to resource    database/-file (internal),-   4.2 selects search list records from search list update file    (interest_area)    -   (Selection qualifier [ST_ID], [interest_area] (=obligatory)).-   4.3 transfers search list records via an interface to search list    database/-file (internal, interes_area).-   4.4 selects from thesaurus database/-file (external,client),    -   (Selection qualifier [ST_ID] (obligatory), [interest_area]        (=facultative)).-   4.5 transfers thesaurus records via an interface to thesaurus    database/-file (internal).-   4.6 selects from index database/-file (external,client),    -   (Selection qualifier [doc_prof_ID] (=obligatory), [Doc_cl]        (=facultative))/loads index files from external client-related        resource directory-   4.7 transfers index records/-file via an interface to index database    (internal)./to the internal client-related resource directory-   4.8 selects document from document DB (external,client) with doc_id    -   (Selection qualifier [doc_prof_ID] (=obligatory), [Doc_cl]        (=facultative))/opens document file (external,client)-   4.9 transfers document records/-file via an interface to document    database (internal)./to the internal client-related document    directory

Finally an example for interfaces of the previously explained givenexample is illustrated in FIG. 82 by the interface model of the process“prelimitation”.

1. A method for automatic searching and synchronous content display of apredefined set of documents in list form in a displaying device,comprising: encapsulated text extracts of various length taken from thedocuments or synonyms of said text extracts in a natural language form,said text extracts or their synonyms stored as data objects in apersistent data store, creating detailing relations that define couplesof the said objects wherein one object more precisely states a meaningof the other object, mapping said detailing relations by attributes ofthe objects containing references to longer encapsulated text extractsthat are more precise and shorter encapsulated text extracts that areless precise, creating chains of text extracts from the mapped detailingrelations which start with words extracted from said documents and endwith headlines, assigning each of the text extracts of said chains to aclass enabling queries of the persistent data store by a computerdisplaying a text extract assigned to a longer class after selection ofa text extract assigned to a shorter class, and gradually displaying anincreasing part of the document and representing content of saiddocument with more and more detail.
 2. The method according to claim 1,wherein the detailing relations to text extracts belonging to a certainclass are represented by certain attributes which are each specific forthe class and which represent all detailing relations to objects of thatclass, and further comprising the steps of: enabling the computer toquery for each text extract all available detailing relations toextracts of the shortest class, reading related text extracts from thepersistent data store, displaying related text extracts on thedisplaying device, displaying a same link of all said chains of textextracts thereby representing all documents equivalently to the samedegree of detail, and enabling the search to reach the end of all chainsat the same time after a couple of queries.
 3. The method according toclaim 1, further comprising: thesaurus relations defining connectionswith superordinated, associated, and subordinated text extracts andcombining relations defining connections with text extracts appearingand not appearing in the same document, said thesaurus relations andsaid combining relations each being represented as references by aspecific attribute of the data objects to be queried by the computer. 4.The method according to claim 3, wherein a user does not need toformulate the query but only has to choose text extracts and actions inthe displaying device, wherein underlying data base queries aregenerated automatically, and wherein the text extracts which areselected by the queries from the persistent data store are connectedwith chosen text extracts by any of said relations.
 5. The methodaccording to claim 1, wherein a relation between a longest link of thesaid chain of text extracts and one or more documents or documentprofiles is mapped so that each text extract is assigned directly orindirectly to a document or document profile by a text extract of thelongest class.
 6. The method according to claim 1, wherein the same textextracts or their synonyms appearing in said documents are onlydisplayed once and wherein all connections of text extracts includeconnections of synonyms.
 7. The method according to claim 1, whereintext extracts connected by the detailing relation are displayed closetogether in list form resulting in a perceivable order of the textextracts.
 8. The method according to claim 1, wherein a group ofdocuments are classified by document classes which are connectedlogically with the data objects of the text extracts representing thedocument so that a connection of a data object with a document classcorresponds to a logical relation with the documents contained in saiddocument class or directly assigned by one or more data attributes todata objects representing documents or document profiles of a certaindocument class.
 9. The method according to claim 8, wherein the documentclasses define non-thematic characteristics in a certain combinationthereby providing constraints for the search for documents, documentprofiles and text extracts.
 10. The method according to claim 1, whereinthe relations between the data objects are either local or globaldepending on the assigned document classes, said global relations arevalid for all documents, said local relations are only applied todocuments assigned to a certain document class so that only textextracts are displayed at a query connected with a chosen text extractby a relation applied to a restriction.
 11. The method according toclaim 1, wherein parts of retrieved document sets are transferred toother logical or physical data storages together with their logicallyrelated data objects so that search features are kept intact.
 12. Themethod according to claim 1, wherein the task of displaying informationin list form is performed by document profiles containing text extractsof the document, document-related characteristics, system-relatedcharacteristics, and a link to the document (reference) so that thedocument is only loaded if required by a user.
 13. The method accordingto claim 1, wherein document profiles are retrieved by classificationstructures comprising directories in form of matrices and network plansbeing logically related to the document profiles.